Measures of pseudorandomness for binary sequences constructed using finite fields
نویسندگان
چکیده
We extend the results of Goubin, Mauduit and Sárközy on the well-distribution measure and the correlation measure of order k of the sequence of Legendre sequences with polynomial argument in several ways. We analyze sequences of quadratic characters of finite fields of prime power order and consider in each case two, in general, different definitions of well-distribution measure and correlation measure of order k, respectively. c © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Measures of pseudorandomness of finite binary lattices , II . ( The symmetry measures . )
In an earlier paper Gyarmati introduced and studied the symmetry measure of pseudorandomness of binary sequences. The goal of this paper is to extend this definition to two dimensions, i.e., to binary lattices. Three different definitions are proposed to do this extension. The connection between these definitions is analyzed. It is shown that these new symmetry measures are independent of the o...
متن کاملConstruction of pseudorandom binary lattices using elliptic curves
In an earlier paper Hubert, Mauduit and Sárközy introduced and studied the notion of pseudorandomness of binary lattices. Later constructions were given by using characters and the notion of multiplicative inverse over finite fields. In this paper a further large family of pseudormandom binary lattices is constructed by using elliptic curves. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملLarge Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I
In earlier papers we introduced the measures of pseudorandomness of finite binary sequences [13], introduced the notion of f–complexity of families of binary sequences, constructed large families of binary sequences with strong PR (= pseudorandom) properties [6], [12], and we showed that one of the earlier constructions can be modified to obtain families with high f–complexity [4]. In another p...
متن کاملA complexity measure for families of binary sequences
In earlier papers finite pseudorandom binary sequences were studied, quantitative measures of pseudorandomness of them were introduced and studied, and large families of “good” pseudorandom sequences were constructed. In certain applications (cryptography) it is not enough to know that a family of “good” pseudorandom binary sequences is large, it is a more important property if it has a “rich”,...
متن کاملMeasures of pseudorandomness of finite binary lattices , I ( The measures Q k , normality . )
In an earlier paper Hubert, Mauduit and Sárközy defined the notion of binary lattice, they introduced the measures of pseudorandomness of binary lattices, and they constructed a binary lattice with strong pseudorandom properties with respect to these measures. Later further constructions of this type have been given by different authors. In this series we will study the measures of pseudorandom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009